Fast algorithms for polynomial evaluation and differentiation at special knots
نویسندگان
چکیده
We present fast evaluating and differentiating algorithms for the Hermite interpolating polynomials with the knots of multiplicity 2, which are generated dynamically in a field , , K K by the recurrent formula of the form 1 0 1,2,.., 1; i i x x i n x . As in the case of Lagrange-Newton interpolating algorithms, the running time of these algorithms is C n O n base operations from the field K, where log C n O n n denotes the time needed to compute the wrapped convolution in K.
منابع مشابه
Fast and stable algorithms for discrete spherical Fourier transforms
In this paper, we propose an algorithm for the stable and eecient computation of Fourier expansions of square integrable functions on the unit sphere S R 3 , as well as for the evaluation of these Fourier expansions at special knots. The heart of the algorithm is an eecient realization of discrete Legendre function transforms based on a modiied and stabilized version of the Driscoll{Healy algor...
متن کاملFast interpolating algorithms in cryptography
We present two fast polynomial interpolating algorithms with knots generated in a field K by the recurrent formula of the form ( ) 1 0 1,2,.., 1; i i x x i n x α β γ − = + = − = . The running time of them is ( ) ( ) C n O n + base operations from K, where ( ) ( ) 2 log C n O n n = denotes the time needed to compute the wrapped convolution in K. Moreover, we give an application of these algorith...
متن کاملFast simplicial quadrature-based finite element operators using Bernstein polynomials
We derive low-complexity matrix-free finite element algorithms for simplicial Bernstein polynomials on simplices. Our techniques, based on a sparse representation of differentiation and special block structure in the matrices evaluating B-form polynomials at warped Gauss points, apply to variable coefficient problems as well as constant coefficient ones, thus extending our results in [14].
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملHeegaard Floer Homology and Alternating Knots
In [23] we introduced a knot invariant for a null-homologous knot K in an oriented three-manifold Y , which is closely related to the Heegaard Floer homology of Y (c.f. [21]). In this paper we investigate some properties of these knot homology groups for knots in the three-sphere. We give a combinatorial description for the generators of the chain complex and their gradings. With the help of th...
متن کامل